Online As ending Au tions for Gradually Expiring Items

In entive-Compatible Online Au tions for Digital Goods

Competitive Analysis of In entive Compatible On-Line Au tions

Ascending Auctions for Gradually Expiring Items

We consider auction mechanisms for the allocation ofM items that are identical to each other except for the fact that the items have different expiration times, and each item must be allocated before it expires. This model seems applicable in many economic situations where both items and buyers have a finite “life-time”, e.g. the allocation of transportation tickets. We are interested in situat...

Conceptualised Deviations from Expected Normalities a Semantic Comparison between Lexical Items Ending in -ful and -less

In our article, we start by posing the question why some adjectival stems can end both in -ful and -less, while others take only one of the endings. Together these items make up around 1% of the entries in a good dictionary. It soon becomes clear that we need to use several basic concepts from cognitive linguistics to answer our question: boundedness, mass vs. individual, part-whole relations a...

A Efficiency of Sequential English Auctions with Dynamic Arrivals

We study a setting of online auctions with expiring/perishable items: K items are sold sequentially, buyers arrive over time and have unit-demand. The goal is to maximize the social welfare (sum of winners’ values). Most previously suggested mechanisms for this model are direct-revelation. In contrast, in real-life we usually see open mechanisms, most often a sequence of English auctions. We as...